Improved approximation algorithms for constrained fault-tolerant resource allocation
نویسندگان
چکیده
منابع مشابه
Constrained Fault-Tolerant Resource Allocation
We follow [18,25] and give a series of improved results for the Constrained Fault-Tolerant Resource Allocation (FTRA) problem. In FTRA, we are given a set of sites containing facilities as resources, and a set of clients consuming these resources. Specifically, each site i is allowed to open at most Ri facilities with cost fi for each opened facility. Each client j requires an allocation of rj ...
متن کاملUnconstrained and Constrained Fault-Tolerant Resource Allocation
First, we study the Unconstrained Fault-Tolerant Resource Allocation (UFTRA) problem (a.k.a. FTFA problem in [19]). In the problem, we are given a set of sites equipped with an unconstrained number of facilities as resources, and a set of clients with setR as corresponding connection requirements, where every facility belonging to the same site has an identical opening (operating) cost and ever...
متن کاملImproved Approximation Algorithms for Resource Allocation
We study the problem of finding a most profitable subset of n given tasks, each with a given start and finish time as well as profit and resource requirement, that at no time exceeds the quantity B of available resource. We show that this NP-hard Resource Allocation problem can be (1/2−ε)-approximated in polynomial time, which improves upon earlier approximation results for this problem, the be...
متن کاملApproximation algorithms for dynamic resource allocation
We consider a problem of allocating limited quantities of M types of resources among N independent activities that evolve over T epochs. In each epoch, we assign to each activity a task which consumes resources, generates utility, and determines the activity’s subsequent state. We study the complexity of, and approximation algorithms for, maximizing average utility.
متن کاملImproved Approximation Algorithm for Fault-Tolerant Facility Placement
We consider the Fault-Tolerant Facility Placement problem (FTFP ), which is a generalization of the classical Uncapacitated Facility Location problem (UFL). In the FTFP problem we have a set of clients C and a set of facilities F . Each facility i ∈ F can be opened many times. For each opening of facility i we pay fi ≥ 0. Our goal is to connect each client j ∈ C with rj ≥ 1 open facilities in a...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 2015
ISSN: 0304-3975
DOI: 10.1016/j.tcs.2015.02.029